首页> 外文OA文献 >A hybrid metaheuristic approach to the university course timetabling problem
【2h】

A hybrid metaheuristic approach to the university course timetabling problem

机译:大学课程时间表问题的混合元启发式方法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

This paper describes the development of a novel metaheuristic that combines an electromagnetic-like mechanism (EM) and the great deluge algorithm (GD) for the University course timetabling problem. This well-known timetabling problem assigns lectures to specific numbers of timeslots and rooms maximizing the overall quality of the timetable while taking various constraints into account. EM is a population-based stochastic global optimization algorithm that is based on the theory of physics, simulating attraction and repulsion of sample points in moving toward optimality. GD is a local search procedure that allows worse solutions to be accepted based on some given upper boundary or ‘level’. In this paper, the dynamic force calculated from the attraction-repulsion mechanism is used as a decreasing rate to update the ‘level’ within the search process. The proposed method has been applied to a range of benchmark university course timetabling test problems from the literature. Moreover, the viability of the method has been tested by comparing its results with other reported results from the literature, demonstrating that the method is able to produce improved solutions to those currently published. We believe this is due to the combination of both approaches and the ability of the resultant algorithm to converge all solutions at every search process.
机译:本文介绍了一种新颖的元启发式方法的发展,该方法结合了类电磁机制(EM)和大洪水算法(GD)来解决大学课程时间表问题。这个众所周知的时间表问题将讲座分配给特定数量的时隙和房间,从而在考虑各种约束的同时最大化时间表的整体质量。 EM是一种基于种群的随机全局优化算法,该算法基于物理理论,模拟了采样点向最优方向的吸引和排斥。 GD是一种本地搜索程序,它允许根据某些给定的上限或“级别”接受更差的解决方案。在本文中,从吸引力排斥机制计算出的动态力被用作降低速率,以更新搜索过程中的“水平”。从文献中,所提出的方法已应用于一系列基准大学课程时间表测试问题。此外,通过将其结果与文献中其他报道的结果进行比较,测试了该方法的可行性,表明该方法能够为当前发布的方法提供改进的解决方案。我们认为,这是由于这两种方法的结合以及所得算法在每个搜索过程中收敛所有解的能力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号